Discover Dependencies from Data - A Review
نویسندگان
چکیده
Functional and inclusion dependency discovery is important to knowledge discovery, database semantics analysis, database design, and data quality assessment. Motivated by the importance of dependency discovery, this paper reviews the methods for functional dependency, conditional functional dependency, approximate functional dependency and inclusion dependency discovery in relational databases and a method for discovering XML functional dependencies. Keyword: integrity constraint, functional dependencies, inclusion dependencies, conditional functional dependencies, XML, knowledge discovery, data quality
منابع مشابه
A genetic algorithm to discover relaxed functional dependencies from data
Approximate functional dependencies are used in many emerging application domains, such as the identification of data inconsistencies or patterns of semantically related data, query rewriting, and so forth. They can approximate the canonical definition of functional dependency (fd) by relaxing on the data comparison (i.e., by considering data similarity rather than equality), on the extent (i.e...
متن کاملDiscovery of High-Dimensional Inclusion Dependencies∗
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such information is not available as explicit meta data, it is possible to discover potential dependencies from the source database extents. However, the complexity of such discovery problems is typically exponential in the number...
متن کاملAutomatic Discovery of Object-Centric Behavioral Constraint Models
Process discovery techniques have successfully been applied in a range of domains to automatically discover process models from event data. Unfortunately existing discovery techniques only discover a behavioral perspective of processes, where the data perspective is often as a second-class citizen. Besides, these discovery techniques fail to deal with object-centric data with manyto-many relati...
متن کاملUncovering disassortativity in large scale-free networks.
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and social and biological networks, are often characterized by degree-degree dependencies between neighboring nodes. In this paper, we propose a new way of measuring degree-degree dependencies. One of the problems with the commonly used assortativity coefficient is that in disassortative networks its ma...
متن کاملLetting Keys and Functional Dependencies out of the Bag
Classical database theory is largely a theory of relations. Relations are sets of tuples in which no duplicate tuples occur. In practice, duplicate elimination is an operation that is considered to be too expensive in many situations. Fundamental classes of integrity constraints interact differently over bags than they do over relations. This holds for keys and functional dependencies, for exam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Knowl. Data Eng.
دوره 24 شماره
صفحات -
تاریخ انتشار 2012